Towards Representation Independence in PAC Learning
نویسنده
چکیده
In the recent development ofwrious models of learning inspired by the PAC learning model (introduced by Valiant) there has been a trend towards models which are as representation independent as possible: We review this development and discuss the advantages of representation independence. Motivated by the research in learning, we propose a framework for studying the combinatorial properties of representations.
منابع مشابه
Learning Graphical Models over partial k-trees
We show that the class of strongly connected graphical models with tree-width at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Previous approaches to this problem, such as those of Chow ([1]), and Hoffgen ([7]) have shown that this class is PAC-learnable (though not necessarily efficiently unless k = 1) by reducing to a NP-complete combinatorial ...
متن کاملPAC Associative Reinforcement Learning
General algorithms for the reinforcement learning problem typically learn policies in the form of a table that directly maps the states of the environment into actions. When the state-space is large these methods become impractical. One approach to increase e ciency is to restrict the class of policies by considering only policies that can be described using some xed representation. This paper ...
متن کاملComparative Textbook Evaluation: Representation of Learning Objectives in Locally and Internationally Published ELT Textbooks
The present study evaluated the learning objectives represented in the recent Iranian nation-wide ELT textbooks, i.e. Prospect and Vision series, and compared them to those in the internationally-published textbook of Four Corners. To this end, Bloom’s revised taxonomy of learning objectives was utilized as the analytical framework to scrutinize the tasks and exercises of the textbooks using a ...
متن کاملFirst-Order jk-Clausal Theories are PAC-Learnable
We present positive PAC-learning results for the nonmonotonic inductive logic programming setting. In particular, we show that first order range-restricted clausal theories that consist of clauses with up to k literals of size at most j each are polynomialsample polynomial-time PAC-learnable with one-sided error from positive examples only. In our framework, concepts are clausal theories and ex...
متن کاملCryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness results are derived from two public-key cryptosystems due to Regev, which are based on the worstcase hardness of well-studied lattice problems. Specifically, we prove that a polynomial-time algorithm for PAC learning i...
متن کامل